A New Effective Local Search Heuristic for the Maximum Clique Problem
نویسنده
چکیده
An edge based local search algorithm, called ELS, is proposed for the maximum clique problem (MCP), a well-known combinatorial optimization problem. ELS is a two phased local search method effectively £nds the near optimal solutions for the MCP. A parameter ’support’ of vertices de£ned in the ELS greatly reduces the more number of random selections among vertices and also the number of iterations and running times. Computational results on BHOSLIB and DIMACS benchmark graphs indicate that ELS is capable of achieving state-of-the-art-performance for the maximum clique with reasonable average running times. Keywords—Maximum clique, local search, heuristic, NP-complete.
منابع مشابه
A Replicator Equations-Based Evolutionary Algorithm for the Maximum Clique Problem
In this paper we propose a heuristic based evolutionary algorithm for the Maximum Clique Problem. The algorithm is based on a local search heuristic centered on a continuous formulation of the problem which is approached with a class of dynamical systems called Replicator Equations. We show how, embedding this local search heuristic within an evolutionary algorithm, help the replicator equation...
متن کاملA new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search
In this paper we present an exact algorithm for the maximum-weight clique problem on arbitrary undirected graphs. The algorithm based on a fact that vertices from the same independent set couldn’t be included into the same maximum clique. Those independent sets are obtained from a heuristic vertex coloring where each of them is a color class. Color classes and a backtrack search are used for pr...
متن کاملBreakout Local Search for maximum clique problems
The maximum clique problem (MCP) is one of the most popular combinatorial optimization problems with various practical applications. An important generalization of MCP is the maximum weight clique problem (MWCP) where a positive weight is associate to each vertex. In this paper, we present Breakout Local Search (BLS) which can be applied to both MC and MWC problems without any particular adapta...
متن کاملAn Efficient approach for the Optimization version of Maximum Weighted Clique Problem
Given a graph and a weight function defined on the vertex set of a graph, the maximum weighted clique (MWC) problem calls for finding the number of vertices with maximum total weight and also any two of vertices are pairwise adjacent. In this paper, an edge based local search algorithm, called ELS, is proposed for the MWC, a well-known combinatorial optimization problem. ELS is a two phased loc...
متن کاملAnnealed replication: a new heuristic for the maximum clique problem
In this paper, a new heuristic for approximating the maximum clique problem is proposed, based on a detailed analysis of a class of continuous optimization models which yield a complete solution to this NP-hard combinatorial problem. The idea is to alter a regularization parameter iteratively in such a way that an iterative procedure with the updated parameter value would avoid unwanted, ine ci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013